Fast iterative reconstruction for multi-spectral CT by a Schmidt orthogonal modification algorithm (SOMA)

نویسندگان

چکیده

Abstract Multi-spectral CT (MSCT) is increasingly used in industrial non-destructive testing and medical diagnosis because of its outstanding performance like material distinguishability. The process obtaining MSCT data can be modeled as a nonlinear system the basis decomposition comes down to inverse problem system. For different spectra data, geometric inconsistent parameters cause geometrical rays, which will lead mismatched How solve equations accurately quickly hot issue. This paper proposes general iterative method (SOMA) invert equations. SOMA gives confidence searches along more accurate hyperplane by Schmidt orthogonalization, get optimal solution quickly. validity verified experiments. results show that decompose images improve convergence speed greatly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast System Matrix Calculation in CT Iterative Reconstruction

Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

Statistical iterative reconstruction algorithm for X-ray phase-contrast CT

Grating-based phase-contrast computed tomography (PCCT) is a promising imaging tool on the horizon for pre-clinical and clinical applications. Until now PCCT has been plagued by strong artifacts when dense materials like bones are present. In this paper, we present a new statistical iterative reconstruction algorithm which overcomes this limitation. It makes use of the fact that an X-ray interf...

متن کامل

A Novel Iterative CT Reconstruction Approach Based on FBP Algorithm

The Filtered Back-Projection (FBP) algorithm and its modified versions are the most important techniques for CT (Computerized tomography) reconstruction, however, it may produce aliasing degradation in the reconstructed images due to projection discretization. The general iterative reconstruction (IR) algorithms suffer from their heavy calculation burden and other drawbacks. In this paper, an i...

متن کامل

A fast randomized algorithm for orthogonal projection

We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A, provided that both A and its adjoint A can be applied rapidly to arbitrary vectors. As an intermediate step, the algorithm solves the overdetermined linear l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems

سال: 2023

ISSN: ['0266-5611', '1361-6420']

DOI: https://doi.org/10.1088/1361-6420/acdaee